Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution

doi:10. 19682/ j. cnki. 1005-8885. 2023. 0006

中国邮电高校学报(英文) ›› 2023, Vol. 30 ›› Issue (5): 51-60.doi: 10. 19682/ j. cnki. 1005-8885. 2023. 0006

Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution

孟慧¹,任利娜¹,赵宗渠²

1. 河南理工大学
2. 河南理工大学计算机科学与技术学院

收稿日期:2022-09-28 修回日期:2023-03-05 出版日期:2023-10-31 发布日期:2023-10-30
通讯作者: 赵宗渠 E-mail:zhaozong_qu@hpu.edu.cn
基金资助:
河南省高校基本科研业务费专项资金资助;河南省青年人才托举工程项目;“陕西省信息通信网络及安全重点实验室”开放课题

Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution

College of Software, Henan Polytechnic University, Jiaozuo 454000, China

Received:2022-09-28 Revised:2023-03-05 Online:2023-10-31 Published:2023-10-30
Supported by:
the Henan Key Laboratory of Network Cryptography Technology ( LNCT2022-A11 )

the Shaanxi Key Laboratory of Information Communication Network and Security (ICNS202006).

摘要/Abstract

摘要：

Proxy re-encryption (PRE) allows users to transfer decryption rights to the data requester via proxy. Due to the current PRE schemes from lattice ( LPRE) cannot fulfill chosen-ciphertext attack ( CCA) security, an identity-based PRE (IB-PRE) scheme from learning with errors over ring ( RLWE) assumption with ciphertext evolution (IB-LPRE-CE) was proposed. IB-LPRE-CE generates the private key using the preimage sampling algorithm (SamplePre) and completes the ciphertext delegation using the re-encryption algorithm. In addition, for the problem of ciphertext delegation change caused by the long-term secret key update, the idea of PRE is used to complete ciphertext evolution and the modification of ciphertext delegation, which improves the efficiency of secure data sharing. In terms of security, IB-LPRE-CE is CCA security based on RLWE assumption. Compared with the current LPRE schemes, IB-LPRE-CE offers greater security and improves the computational efficiency of the encryption algorithm.

关键词: proxy re-encryption (PRE), learning with errors over ring ( RLWE), chosen-ciphertext attack ( CCA), ciphertext delegation, ciphertext evolution

Abstract:

Key words: proxy re-encryption (PRE), learning with errors over ring ( RLWE), chosen-ciphertext attack ( CCA), ciphertext delegation, ciphertext evolution

中图分类号:

TP309

Meng Hui, Ren Lina, Zhao Zongqu. Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution[J]. The Journal of China Universities of Posts and Telecommunications, 2023, 30(5): 51-60.

参考文献

[1] BLAZE M, BLEUMER G, STRAUSS M, et al. Divertible protocols and atomic proxy cryptography. Advances in Cryptology: Proceedings of the 1998 International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’98), 1998, May 31 - Jun 4, Espoo, Finland. LNCS 1403. Berlin, Germany: Springer, 1998: 127 -144.

[2] ATENIESE G, FU K, GREEN M, et al. Improved proxy re-encryption schemes with applications to secure distributed storage. Proceedings of the 12th Annual Network and Distributed System Security Symposium (NDSS'05), 2005, Feb 3 - 4, San Diego, CA, USA. New York, NY, USA: ACM, 2005: 1 -25.

[3] GREEN M, ATENIESE G. Identity-based proxy re-encryption. Proceedings of the 5th International Conference on Applied Cryptography and Network Security (ACNS'07), 2007, Jun 5 -8, Zhuhai, China. LNSC 4521. Berlin, Germany: Springer, 2007: 288 -306.

[4] SHOR P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 1999, 41(2): 303 -332.

[5] XAGAWA K. Cryptography with lattices. Ph D Thesis. Tokyo, Japan: Tokyo Institute of Technology, 2010.

[6] SINGH K, RANGAN C P, BANERJEE A K. Lattice based identity based proxy re-encryption scheme. Journal of Internet Services and Information Security, 2013, 3(3/4): 38 -51.

[7] WANG X Y, HU A Q, FANG H. Improved collusion-resistant unidirectional proxy re-encryption scheme from lattice. IET Information Security, 2020, 14(3): 342 -351.

[8] DUTTA P, SUSILO W, DUONG D H, et al. Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model. Theoretical Computer Science, 2021, 871: 16 -29.

[9] BARKER E B. Recommendation for key management, Part 1-General. NIST SP 800 - 57. Gaithersburg, MD, USA: National Institute of Standards and Technology (NIST), 2007.

[10] LYUBASHEVSKY V, PEIKERT C, REGEV O. On ideal lattices and learning with errors over rings. Journal of the Association for Computing Machinery, 2013, 60(6): Article 43/1 -35.

[11] ZHANG Y, LIU Y, GUO Y R, et al. Adaptively secure efficient (H)IBE over ideal lattice with short parameters. Entropy, 2020,

22(11): Article 1247/1 -19.

[12] LIU Z Y, TSENG Y F, TSO R, et al. Quantum-resistant anonymous identity-based encryption with trable identities. IET Information Security, 2022, 16(2): 111 -126.

[13] ZHANG E, PEI Y Y, DU J. RLWE-based ciphertext-policy attribute proxy re-encryption. Journal on Communications, 2018, 39(11): 129 -137 (in Chinese).

[14] POLYAKOV Y, ROHLOFF K, SAHU G, et al. Fast proxy re-encryption for publish/ subscribe systems. ACM Transactions on Privacy and Security, 2017, 20(4): Article 14/1 -31.

[15] YANG X Y, WU L Q, ZHANG M Q, et al. An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption. Computers and Mathematics with Applications, 2013, 65(9): 1254 -1263.

[16] MICCIANCIO D, PEIKERT C. Trapdoors for lattices: simpler, tighter, faster, smaller. Advances in Cryptology: Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques ( EUROCRYPT'12 ), 2012, Apr 15 - 19, Cambridge, UK. LNSC 7237. Berlin, Germany: Springer, 2012: 700 -718.

[17] AONO Y, BOYEN X, PHONG L T, et al. Key-private proxy re-encryption under LWE. Progress in Cryptology: Proceedings of the 14th International Conference on Cryptology in India (INDOCRYPT'13), 2013, Dec 7 - 10, Mumbai, India. LNSC 8250. Berlin, Germany: Springer, 2013: 1 -18.

[18] BANASZCZYK W. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, 1993, 296: 625 -635.

[19] BANASZCZYK W. Inequalities for convex bodies and polar reciprocal lattices in Rn . Discrete and Computational Geometry, 1995, 13(2): 217 -231.

[20] SUN Y X, SUSILO W, ZHANG F T, et al. CCA-secure revocable identity-based encryption with ciphertext evolution in the cloud. IEEE Access, 2018, 6: 56977 -56983.

[21] SUN Y X, MU Y, SUSILO W, et al. Revocable identity-based encryption with server-aided ciphertext evolution. Theoretical Computer Science, 2020, 815: 11 -24.

[22] YAO S M, SANKAR R, RA I H. A collusion-resistant identity-based proxy re-encryption scheme with ciphertext evolution for secure cloud sharing. Security and Communication Networks, 2020, Article 8833693/1 -16.

[23] YAO S M, DAYOT R V J, KIM H J, et al. A novel revocable and identity-based conditional proxy re-encryption scheme with ciphertext evolution for secure cloud data sharing. IEEE Access, 2021, 9: 42801 -42816.

[24] KIRSHANOVA E. Proxy re-encryption from lattices. Proceeding of the 17th International Conference on Public-Key Cryptography (PKC'14), 2014, Mar 26 -28, Buenos Aires, Argentina. LNSC 8383. Berlin, Germany: Springer, 2014: 77 -94.

[25] YIN W, WEN Q Y, LI W M, et al. Identity based proxy re-encryption scheme under LWE. KSII Transactions on Internet and Information Systems, 2017, 11(12): 6116 -6132.

[26] HOU J Q, JIANG M M, GUO Y Y, et al. Efficient identity-based multi-bit proxy re-encryption over lattice in the standard model. Journal of Information Security and Applications, 2019, 47: 329 -334.

Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution

Identity-based proxy re-encryption scheme from RLWE assumption with ciphertext evolution

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	Peng Weiping, Cui Shuang, Song Cheng, Han Ning. Enhanced secure medical data sharing with traceable and direct revocation[J]. 中国邮电高校学报(英文版), 2023, 30(1): 66-79.
[2]	Han Yushan, Che Bichen, Liu Jiali, Dou Zhao, Di Junyu. Nearly universal and efficient quantum secure multi-party computation protocol[J]. 中国邮电高校学报(英文版), 2022, 29(4): 51-68.
[3]	Han Gang, Xing Qixuan, Zhang Yinghui. Fine-grained cooperative access control scheme with hidden policies[J]. 中国邮电高校学报(英文版), 2021, 28(6): 13-25.
[4]	Tao Yunting, Kong Fanyu, Yu Jia. EPMDA: an efficient privacy-preserving multi-dimensional data aggregation scheme for edge computing-based IoT system [J]. 中国邮电高校学报(英文版), 2021, 28(6): 26-35.
[5]	Xu Yan, Li Zheng, Ding Long, Xu Rui. Cross-domain data cloud storage auditing scheme based on certificateless cryptography [J]. 中国邮电高校学报(英文版), 2021, 28(6): 36-47.
[6]	赵国生张婧婷王健. Research on location privacy protection method of sensor-cloud base station [J]. 中国邮电高校学报(英文版), 2021, 28(1): 64-77.
[7]	赵宗渠马少提王永军汤永利叶青. Two-factor ( biometric and password) authentication key exchange on lattice based on key consensus [J]. 中国邮电高校学报(英文版), 2020, 27(6): 42-53.
[8]	林杰刘川意方滨兴. VMScan: an out-of-VM malware scanner [J]. 中国邮电高校学报(英文版), 2020, 27(4): 59-68.
[9]	Tang Yongli, Wang Mingming, Ye Qing, Qin Panke, Zhao Zongqu. Lattice-based hierarchical identity-based broadcast encryption scheme in the standard model[J]. 中国邮电高校学报(英文版), 2019, 26(4): 70-79.
[10]	Cai Xiumei, Liu Chao, Huang Xianying, Liu Xiaoyang, Cao Qiong, Yang Hongyu. Dynamic model of computer viruses under the effect of removable media and external computers[J]. 中国邮电高校学报(英文版), 2018, 25(4): 86-93.
[11]	Min Xiangshen, Fan Jiulun, Zhang Xuefeng, Ren Fang. Color image encryption scheme based on chaotic systems[J]. 中国邮电高校学报(英文版), 2018, 25(2): 39-48.
[12]	Ding Haiyang, Li Zichen, Bi Wei. (k, n) halftone visual cryptography based on Shamir‘s secret sharing[J]. 中国邮电高校学报(英文版), 2018, 25(2): 60-76.
[13]	Chen Shangdi, Wen Jiejing. New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks[J]. 中国邮电高校学报(英文版), 2017, 24(5): 16-22.
[14]	谢佳胡予濮高军涛高雯李雪莲. Attribute-based signatures on lattices[J]. 中国邮电高校学报(英文版), 2016, 23(4): 83-90.
[15]	冯超辛阳. Fast key generation for Gentry-style homomorphic encryption[J]. Acta Metallurgica Sinica(English letters), 2014, 21(6): 37-44.